A Representation for Many Player Generalized Divide the Dollar Games

نویسندگان

چکیده

Divide the dollar is a simplified version of two player bargaining problem game devised by John Nash. The generalized divide has n>2 players. Evolutionary algorithms can be used to evolve individual players for this but representation—i.e., genome plus move or search operator(s)—must carefully chosen since it affects process. This paper proposes an entirely new representation called demand matrix. Each in evolving population now represents collection n rather than just player. Players use previous outcomes decide their choices (bids) current round. scales linearly with number and operator variant evolution strategy. results indicate that proposed permits efficient large populations high payoffs fair sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Punishing greediness in Divide-the-dollar games

Brams and Taylor (1994) presented a version of the Divide-the-dollar game (DD), which they call DD1. DD1 suffers from the following drawback: when each player demands approximately the entire dollar, then if the least greedy player is unique, then this player obtains approximately the entire dollar even if he is only slightly less greedy than the other players. I introduce a parametrized family...

متن کامل

Learning and Solving Many-Player Games through a Cluster-Based Representation

In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. A cluster groups together agents with a similar “strategic view” of the game. We learn the clustered approximation from data consisting of strategy profiles and payoffs, which may be obtained from observations of play ...

متن کامل

Replication Study: Learning and Solving Many-Player Games through a Cluster-Based Representation

I have replicated a study by Ficici, Parkes, and Pfeffer on Learning and Solving Many-Player Games through a Cluster-Based Representation[3]. This work proposes a method for approximately solving large games. Finding Nash equilibria is a relevant problem to many multi-agent problems in artificial intelligence, but unfortunately it is in general a hard problem: given a game in terms of players, ...

متن کامل

Presidential Particularism and Divide-the-Dollar Politics

When influencing the allocation of federal dollars across the country, do presidents strictly pursue maximally efficient outcomes, or do they systematically target dollars to politically influential constituencies? In a county-level analysis of federal spending from 1984 to 2008, we find that presidents are not universalistic, but particularistic – that is they reliably direct dollars to specif...

متن کامل

Too Many Questionnaires: Measuring Player Experience Whilst Playing Digital Games

Player experience is an important area of research in digital games. The findings are crucial for the developers, designers and reviewers of games, allowing for the better understanding of player experience whilst playing digital games. Questionnaires are a way to directly measure the reported experiences of players. This approach in games research, however, is challenging for new researchers b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games

سال: 2023

ISSN: ['2073-4336']

DOI: https://doi.org/10.3390/g14020019